Choosing a Spanning Tree for the Integer Lattice Uniformly
نویسندگان
چکیده
منابع مشابه
CHOOSING A SPANNING TREE FOR THE INTEGER LATTICE UNIFORMLY Running Head: RANDOM SPANNING TREES
Consider the nearest neighbor graph for the integer lattice Z in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece gets larger, this approaches a limiting measure on the set of spanning graphs for Z. This is shown to be a tree if and only if d ≤ 4. In this case, the tree has...
متن کاملA Lattice Spanning-tree Entropy Function
The function W (a, b) = 2π 0 dx 2π 0 dy ln[1−a cos x−b cos y−(1−a−b) cos(x+y)] which expresses the spanning-tree entropy for various two dimensional lattices, for example, is evaluated directly in terms of standard functions. It is applied to derive several limiting values of the Triangular lattice Green function.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملA mixed integer linear formulation for the minimum label spanning tree problem
In this paper we deal with the minimum label spanning tree problem. This is a relevant problem with applications such as telecommunication networks or electric networks, where each edge is assigned with a label (such as a color) and it is intended to determine a spanning tree with the minimum number of different labels. We introduce some mixed integer formulations for this problem and prove tha...
متن کاملCombining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
We consider the generalized version of the classical Minimum Spanning Tree problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster must be connected. We present a Variable Neighborhood Search (VNS) approach which uses three different neighborhood types. Two of them work in complementary ways in order to maximize search effectivity. Both are large ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1991
ISSN: 0091-1798
DOI: 10.1214/aop/1176990223